An exact algorithm for biobjective integer programming problems

We propose an exact algorithm for solving biobjective integer programming problems, which arise in various applications of operations research. The is based on Pascoletti-Serafini scalarizations to search specified regions (boxes) the objective space and returns set nondominated points. implement with different strategies, where choices scalarization model parameters splitting rule differ. then derive bounds number models solved; demonstrate performances variants through computational experiments both as algorithms solution approaches under time restriction. that strategies have advantages aspects: while some are quicker finding whole solutions, others return good-quality solutions terms representativeness when run also compare proposed approach existing algorithms. results our show satisfactory behaviour algorithm, especially limit, it achieves better coverage frontier a smaller compared